ISPCell: an interactive image-based streaming protocol for wireless cellular networks

Remote interaction with immersive 3D environments with acceptable level of quality of experience has become a challenging and interesting research topic. Due to the high data volume required to provide a rich experience to the user, robust and effcient wireless transport protocols have yet to be developed. On the other hand, cellular network technology has been widely deployed and is growing fast. The provision of remote interactive 3D environments over wireless cellular networks has several interesting applications, and it imposes some unsolved issues. Node mobility creates unstable bandwidth, which is a problem when providing smooth interaction to users. Although PDAs and cell phones are low resource devices, which makes it prohibitive to load and render entire virtual environments, they can still render images with relative ease. Based on this idea, this paper proposes a streaming system which relies on an image-based rendering approach, and is composed of several modules: a packetization scheme for images, an image-based rendering approach based on view morphing and its corresponding RTP payload format, and finally a bandwidth feedback mechanism and rate control. This paper illustrates some of the problems faced in this area, and provides a first step towards their solutions. We discuss our algorithms and present a set of simulation experiments to evaluate the performance of the proposed schemes.8th IFIP/IEEE International conference on Mobile and Wireless CommunicationRed de Universidades con Carreras en Informática (RedUNCI

The Trap Coverage Area Protocol for Scalable Vehicular Target Tracking

Vehicle target tracking is a sub-field of increasing and increasing interest in the vehicular networking research area, in particular for its potential application in dense urban areas with low associated costs, e.g., by exploiting existing monitoring infrastructures and cooperative collaboration of regular vehicles. Inspired by the concept of trap coverage area, we have originally designed and implemented an original protocol for vehicle tracking in wide-scale urban scenarios, called TCAP. TCAP is capable of achieving the needed performance while exploiting a limited number of inexpensive sensors (e.g., public-authority cameras already installed at intersections for traffic monitoring), and opportunistic vehicle collaboration, with high scalability and low overhead if compared with state-of-the-art literature. In particular, the wide set of reported results show i) the suitability of our TCAP tracking in the challenging urban conditions of high density of vehicles, ii) the very weak dependency of TCAP performance from topology changes/constraints (e.g., street lengths and speed limits), iii) the TCAP capability of self-adapting to differentiated runtime conditions

Blockchain and Fog Computining for Cyberphysical Systems: The Case of Smart Industry

© 1970-2012 IEEE. Blockchain and fog computing are being evaluated as potential support for software and a wide spectrum of critical applications. This article presents the knowledge of blockchain and fog computing required to improve cyberphysical systems. Emerging challenges and issues are also discussed

Design Guidelines for Blockchain-Assisted 5G-UAV Networks

© 1986-2012 IEEE. Fifth generation (5G) wireless networks are designed to meet various end-user quality of service (QoS) requirements through high data rates (typically of gigabits per second) and low latencies. Coupled with fog and mobile edge computing, 5G can achieve high data rates, enabling complex autonomous smart city services such as the large deployment of self-driving vehicles and large-scale artificial-intelligence-enabled industrial manufacturing. However, to meet the exponentially growing number of connected IoT devices and irregular data and service requests in both low- and high-density locations, the process of enacting traditional cells supported through fixed and costly base stations requires rethought to enable on-demand mobile access points in the form of unmanned aerial vehicles (UAV) for diversified smart city scenarios. This article envisions a 5G network environment that is supported by blockchain-enabled UAVs to meet dynamic user demands with network access supply. The solution enables decentralized service delivery (drones as a service) and routing to and from end users in a reliable and secure manner. Both public and private blockchains are deployed within the UAVs, supported by fog and cloud computing devices and data centers to provide a wide range of complex authenticated service and data availability. Particular attention is paid to comparing data delivery success rates and message exchange in the proposed solution against traditional UAV-supported cellular networks. Challenges and future research are also discussed with highlights on emerging technologies such as federated learning

An energy trade framework using smart contracts: Overview and challenges

© 1986-2012 IEEE. The increasing demand for clean, sustainable and reliable energy sources that are secure and stable requires the integration of renewable and edge energy products with the existing power grid. With the introduction of technological advancements and distributed resources, energy users (aka prosumers) can now generate, store and manage their energy requirements, and share their resources with others. BC is a promising technology that can provide secure and verifiable transactions for P2P energy trading, and promote energy conservation. This article recognizes the best practices for sustainable energy, and highlights the benefits of BC and smart contracts in the energy sector. A distributed trading framework and smart contracts are proposed for future versions of BC and integration with other energy products, and potential solutions are suggested

WSN Scheduling for Energy-Efficient Correction of Environmental Modelling

International audienceWireless sensor networks (WSN) are widely used in environmental applications where the aim is to sense a physical parameter such as temperature, humidity, air pollution, etc. Most existing WSN-based environmental monitoring systems use data interpolation based on sensor measurements in order to construct the spatiotemporal field of physical parameters. However, these fields can be also approximated using physical models which simulate the dynamics of physical phenomena. In this paper, we focus on the use of wireless sensor networks for the aim of correcting the physical model errors rather than interpolating sensor measurements. We tackle the activity scheduling problem and design an optimization model and a heuristic algorithm in order to select the sensor nodes that should be turned off to extend the lifetime of the network. Our approach is based on data assimilation which allows us to use both measurements and the physical model outputs in the estimation of the spatiotemporal field. We evaluate our approach in the context of air pollution monitoring while using a dataset from the Lyon city, France and considering the characteristics of a monitoring system developed in our lab. We analyze the impact of the nodes' characteristics on the network lifetime and derive guidelines on the optimal scheduling of air pollution sensors

ISPCell: an interactive image-based streaming protocol for wireless cellular networks

Remote interaction with immersive 3D environments with acceptable level of quality of experience has become a challenging and interesting research topic. Due to the high data volume required to provide a rich experience to the user, robust and effcient wireless transport protocols have yet to be developed. On the other hand, cellular network technology has been widely deployed and is growing fast. The provision of remote interactive 3D environments over wireless cellular networks has several interesting applications, and it imposes some unsolved issues. Node mobility creates unstable bandwidth, which is a problem when providing smooth interaction to users. Although PDAs and cell phones are low resource devices, which makes it prohibitive to load and render entire virtual environments, they can still render images with relative ease. Based on this idea, this paper proposes a streaming system which relies on an image-based rendering approach, and is composed of several modules: a packetization scheme for images, an image-based rendering approach based on view morphing and its corresponding RTP payload format, and finally a bandwidth feedback mechanism and rate control. This paper illustrates some of the problems faced in this area, and provides a first step towards their solutions. We discuss our algorithms and present a set of simulation experiments to evaluate the performance of the proposed schemes.8th IFIP/IEEE International conference on Mobile and Wireless CommunicationRed de Universidades con Carreras en Informática (RedUNCI

A novel solution for achieving anonymity in wireless ad hoc networks

A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of other intermediate nodes to establish communication channels. In such an open environment, malicious intermediate nodes can be a threat to the security and/or anonymity of the exchanged data between the mobile nodes. While data encryption can protect the content exchanged between nodes, routing information may reveal valuable information about end users and their relationships. The main purposes of this paper are to study the possibility of achieving anonymity in ad hoc networks, and propose an anonymous routing protocol, similar to onion routing concept used in wired networks. Our protocol includes a mechanism to establish a trust among mobile nodes while avoiding untrustworthy nodes during the route discovery process. The major objective of our protocol is to allow only trustworthy intermediate nodes to participate in the routing protocol without jeopardizing the anonymity of the communicating nodes. We present our scheme, and report on its performance using an extensive set of simulation set of experiments using ns-2 simulator. Our results indicate clearly that anonymity can be achieved in mobile ad hoc networks, and the additional overhead of our scheme to DSR is reasonably low when compared to a non-secure DSR ad hoc routing protocol

Exact parallel alignment of megabase genomic sequences with tunable work distribution

Sequence Alignment is a basic operation in Bioinformatics that is performed thousands of times, on daily basis. The exact methods for pairwise alignment have quadratic time complexity. For this reason, heuristic methods such as BLAST are widely used. To obtain exact results faster, parallel strategies have been proposed but most of them fail to align huge biological sequences. This happens because not only the quadratic time must be considered but also the space should be reduced. In this paper, we evaluate the performance of Z-align, a parallel exact strategy that runs in user-restricted memory space. Also, we propose and evaluate a tunable work distribution mechanism. The results obtained in two clusters show that two sequences of size 24MBP (Mega Base Pairs) and 23MBP, respectively, were successfully aligned with Z-align. Also, in order to align two 3MBP sequences, a speedup of 34.35 was achieved for 64 processors. The evaluation of our work distribution mechanism shows that the execution times can be sensibly reduced when appropriate parameters are chosen. Finally, when comparing Z-align with BLAST, it is clear that, in many cases, Z-align is able to produce alignments with higher score

A Novel Adaptive and Efficient Routing Update Scheme for Low-Power Lossy Networks in IoT

In this paper, we introduce Drizzle, a new algorithm for maintaining routing information in the Low-power and Lossy Networks (LLNs). The aim is to address the limitations of the currently standardized routing maintenance (i.e. Trickle algorithm) in such networks. Unlike Trickle, Drizzle has an adaptive suppression mechanism that assigns the nodes different transmission probabilities based on their transmission history so to boost the fairness in the network. In addition, Drizzle removes the listen-only period presented in Trickle intervals leading to faster convergence time. Furthermore, a new scheme for setting the redundancy counter has been introduced with the goal to mitigate the negative side effect of the short-listen problem presented when removing the listen-only period and boost further the fairness in the network. The performance of the proposed algorithm is validated through extensive simulation experiments under different scenarios and operation conditions. In particular, Drizzle is compared to four routing maintenance algorithms in terms of control-plane overhead, power consumption, convergence time and packet delivery ratio (PDR) under uniform and random distributions and with lossless and lossy links. The results indicated that Drizzle reduces the control-plane overhead, power consumption and the convergence time by up to 76%, 20% and 34% respectively while maintaining approximately the same PDR rates